A NEW FAMILY OF SECOND-ORDER ITERATIVE METHODS FOR COMPUTING THE MOORE PENROSE INVERSE BASED ON PENROSE EQUATIONS

Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations

An iterative algorithm for estimating the Moore-Penrose generalized inverse is developed. The main motive for the construction of algorithm is simultaneous usage of Penrose equations (2) and (4). Convergence properties of the introduced method are considered as well as their first-order and the second-order error terms. Numerical experience is also presented. AMS Subj. Class.: 15A09.

An accelerated iterative method for computing weighted Moore-Penrose inverse

The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...

New representations for the Moore-Penrose inverse

Fast computing of the Moore-Penrose inverse matrix

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.

Ela Fast Computing of the Moore - Penrose Inverse Matrix

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.